Parsing Strings and Trees with Parse::Eyapp (An Introduction to Compiler Construction)
نویسنده
چکیده
Parse::Eyapp (Extended yapp) is a collection of modules that extends Francois Desarmenien Parse::Yapp 1.05. Eyapp extends yacc/yapp syntax with functionalities like named attributes, EBNF-like expressions, modifiable default action, automatic syntax tree building, semi-automatic abstract syntax tree building, translation schemes, tree regular expressions, tree transformations, scope analysis support, and directed acyclic graphs among others. This article teaches you the basics of Compiler Construction and Parse::Eyapp by building a translator from infix expressions to Parrot Intermediate Representation.
منابع مشابه
Robust Parsing
Robust parsing is introduced as a form of bounded context parsing. As such, the process of parsing deenes a continuous mapping of symbol strings to parse trees, a mapping where small changes (errors) in the symbol string will cause only small changes in the resulting trees. The diierences between robust parsing and LR(k) parsing are explored. A method of generating robust parsers is presented a...
متن کاملParsing Partially Bracketed Input
A method is proposed to convert a Context Free Grammar to a Bracket Context Free Grammar (BCFG). A BCFG is able to parse input strings which are, in part or whole, annotated with structural information (brackets). Parsing partially bracketed strings arises naturally in several cases. One interesting application is semi-automatic treebank construction. Another application is parsing of input str...
متن کاملDesign and Implementation of Tree-transformations in Ensemble Ucb Cs Honors Program Project Report
Tree transformations ooer a convenient method to describe various manipulations that are commonly performed by compilers and language-based editors. Many of the compiler stages, such as semantic analysis, code optimization, and code generation Pelegri-Llopart 1988], are frequently speciied as a sequence of tree transformations that transform parse tree into output representation (e.g. machine l...
متن کاملTabular parsing and algebraic transformations
We present an algebraic description of tabular parsing algorithms that avoids a significant problem of Sikkel’s description, namely that inconsistent parse items cannot be represented. We show that a parse item must be regarded as a pair consisting of a congruence class of partial parse trees and a tuple of strings. A tabular parsing algorithm is described algebraically by a pair of algebras wi...
متن کاملThe GF Grammar Compiler
GF (Grammatical Framework) is a grammar formalism based on the distinction between abstract and concrete syntax. An abstract syntax is a free algebra of trees, and a concrete syntax is a mapping from trees to nested records of strings and features. These mappings are naturally defined as functions in a functional programming language; the GF language provides the customary functional programmin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007